Interpolation in local theory extensions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interpolation in Local Theory Extensions

In this paper we study interpolation in local extensions of a base theory. Weidentify situations in which it is possible to obtain interpolants in a hierarchical manner,by using a prover and a procedure for generating interpolants in the base theory as black-boxes. We present several examples of theory extensions in which interpolants can becomputed this way, and discuss applica...

متن کامل

Hierarchic Reasoning in Local Theory Extensions

We show that for special types of extensions of a base theory, which we call local, efficient hierarchic reasoning is possible. We identify situations in which it is possible, for an extension T1 of a theory T0, to express the decidability and complexity of the universal theory of T1 in terms of the decidability resp. complexity of suitable fragments of the theory T0 (universal or ∀∃). These re...

متن کامل

On Interpolation and Symbol Elimination in Theory Extensions

In this paper we study possibilities of interpolation and symbol elimination in extensions of a theory T0 with additional function symbols whose properties are axiomatised using a set of clauses. We analyze situations in which we can perform such tasks in a hierarchical way, relying on existing mechanisms for symbol elimination in T0. This is for instance possible if the base theory allows quan...

متن کامل

Deciding Local Theory Extensions via E-matching

Satisfiability Modulo Theories (SMT) solvers incorporate decision procedures for theories of data types that commonly occur in software. This makes them important tools for automating verification problems. A limitation frequently encountered is that verification problems are often not fully expressible in the theories supported natively by the solvers. Many solvers allow the specification of a...

متن کامل

On Combinations of Local Theory Extensions

In this paper we study possibilities of efficient reasoning in combinations of theories over possibly non-disjoint signatures. We first present a class of theory extensions (called local extensions) in which hierarchical reasoning is possible, and give several examples from computer science and mathematics in which such extensions occur in a natural way. We then identify situations in which com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2008

ISSN: 1860-5974

DOI: 10.2168/lmcs-4(4:1)2008